An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix

摘要

An algorithm is presented for the efficient and accurate computation of thecoefficients of the characteristic polynomial of a general square matrix. Thealgorithm is especially suited for the evaluation of canonical traces indeterminant quantum Monte-Carlo methods.